An Unsupervised Verb Class Disambiguation

نویسنده

  • Jianguo Li
چکیده

We present an unsupervised learning method for disambiguating verbs that belong to more than one Levin verb class (1993) when occurring in a particular syntactic frame. We used examples that contain unambiguous verbs in each verb class as the training data for ambiguous verbs in that class. A Naive Bayesian classifier was employed for the disambiguation task using context words as features. Our experiments suggest that our unsupervised learning method does not match the supervised one in disambiguating Levin verbs, but it consistently outperforms the random baseline model.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Using a Probabilistic Class-Based Lexicon for Lexical Ambiguity Resolution

This paper presents the use of probabilistic class-based lexica for disambiguation in targetword selection. Our method employs minimal but precise contextual information for disambiguation. That is, only information provided by the target-verb, enriched by the condensed information of a probabilistic class-based lexicon, is used. Induction of classes and fine-tuning to verbal arguments is done ...

متن کامل

Class-based approach to disambiguating Levin verbs

Lapata and Brew (2004) (hereafter LB04) obtain from untagged texts a statistical prior model that is able to generate class preferences for ambiguous Levin (1993) verbs (hereafter Levin). They also show that their informative priors, incorporated into a Naive Bayes classifier deduced from hand-tagged data, can aid in verb class disambiguation. We reanalyse LB04’s prior model and show that a sin...

متن کامل

In Proceedings of the 18 th International Conference on Computational Linguistics , 2000 , Saarbrücken . Using a Probabilistic Class - Based Lexiconfor

This paper presents the use of probabilistic class-based lexica for disambiguation in target-word selection. Our method employs minimal but precise contextual information for disam-biguation. That is, only information provided by the target-verb, enriched by the condensed information of a probabilistic class-based lexicon , is used. Induction of classes and ne-tuning to verbal arguments is done...

متن کامل

Neighbors Help: Bilingual Unsupervised WSD Using Context

Word Sense Disambiguation (WSD) is one of the toughest problems in NLP, and in WSD, verb disambiguation has proved to be extremely difficult, because of high degree of polysemy, too fine grained senses, absence of deep verb hierarchy and low inter annotator agreement in verb sense annotation. Unsupervised WSD has received widespread attention, but has performed poorly, specially on verbs. Recen...

متن کامل

Error Driven Word Sense Disambiguation

In this paper we describe a method for performing word sense disambiguation (WSD). The method relies on unsupervised learning and exploits functional relations among words as produced by a shallow parser. By exploiting an error driven rule learning algorithm (Brill 1997), the system is able to produce rules for WSD, which can be optionally edited by humans in order to increase the performance o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006